﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion

using NStl.Iterators.Support;
using NUnit.Framework;
using System;
using NStl.NUnit.Support.Functors;

namespace NStl.NUnit.AlgorithmFixtures.BinarySearch
{
    [TestFixture]
    public class BinarySearchPredicate : AlgorithmBaseFixture
    {
        private int[] ints = new int[] { };

        [SetUp]
        public void SetUp()
        {
            ints = new int[] { 3, 4, -1, 1, -2, 0, 2 };
            Array.Sort(ints, new AbsLessInt());
        }
        [Test]
        public override void SuccessfullPass()
        {
            ListIterator<int> itFound =
                Algorithm.BinarySearch(NStlUtil.Begin(ints), NStlUtil.End(ints), -3, new AbsLessInt());
            Assert.AreNotEqual(itFound, NStlUtil.End(ints));
            Assert.AreEqual(3, itFound.Value);
        }

        [Test]
        public override void NonSuccessfullPass()
        {
            ListIterator<int> itFound =
                Algorithm.BinarySearch(NStlUtil.Begin(ints), NStlUtil.End(ints), -10, new AbsLessInt());
            Assert.AreEqual(itFound, NStlUtil.End(ints));
        }

        [Test]
        public override void StartIteratorIsEqualToEndIterator()
        {
            ListIterator<int> itFound =
                Algorithm.BinarySearch(NStlUtil.Begin(ints), NStlUtil.Begin(ints), -3, new AbsLessInt());
            Assert.AreEqual(itFound, NStlUtil.Begin(ints));
        }
    }
}
